Sitzung vom 8. October 1883

Quarter Ending 31st October 1883

Cover vol. 8, no. 3, october 2011

Lecture 8: October 1

Consider a simply connected region S of the two-dimensional Cartesian lattice (e.g. a 2n× 2n chessboard). A tiling of S is a covering of all its squares by non-overlapping dominoes, each of which occupies two adjacent squares of the lattice. We want to generate u.a.r. a tiling of S. Such problems arise in statistical physics, where the tilings correspond to configurations of a so-called dimer s...

Cover Special Issue vol. 8, no. 4, October 2011

1883 - 4566

Mobile robot networks emerged in the past few years as a promising distributed computing model. Existing work in the literature typically ensures the correctness of mobile robot protocols via ad hoc handwritten proofs, which are both cumbersome and error-prone. This paper surveys state-of-the-art results about applying formal methods approaches (namely, model-checking, program synthesis, and pr...